Freedom of proof

A PROOF OF FREEDOM FROM CONTRADICTION By ALONZO

Towards a Thread-Local Proof Technique for Starvation Freedom

Today, numerous elaborate algorithms for the effective synchronization of concurrent processes operating on shared memory exist. Of particular importance for the verification of such concurrent algorithms are thread-local proof techniques, which allow to reason about the sequential program of one process individually. While thread-local verification of safety properties has received a lot of at...

Kant's Four Notions of Freedom

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol

The Ad hoc On-demand Distance Vector (AODV) routing protocol allows the nodes in a Mobile Ad hoc Network (MANET) or a Wireless Mesh Network (WMN) to know where to forward data packets. Such a protocol is ‘loop free’ if it never leads to routing decisions that forward packets in circles. This paper describes the mechanization of an existing pen-and-paper proof of loop freedom of AODV in the inte...